#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <set>
#include "tree.h"

using namespace std;

int getMaxDisHelper(Tree *root, int &maxDis)
{
    if (!root) return 0;
    int left = getMaxDisHelper(root->left, maxDis);
    int right = getMaxDisHelper(root->right, maxDis);
    if (maxDis < 1 + left + right) maxDis = 1 + left + right; 
    return 1 + max(left, right);
}

int getMaxDis(Tree *root)
{
    int subTreeMax = 0;
    int dis = getMaxDisHelper(root, subTreeMax);
    return max(subTreeMax, dis);
}

int main(int argc, char **argv)
{
    int input[] = {21,7,5,6,3,2,1,4,6,23,43,54,12,54,8,10,11,35,56};
    //int input[] = {7};
    Tree *root = NULL, *root2 = NULL;
    int result;

    for (int i = 0; i < sizeof(input)/sizeof(int); i++) {
        TreeInsert(root, input[i]);
    }

    print_ascii_tree(root);
    result = getMaxDis(root);
    cout <<"Max distance between two nodes of the tree is " << result << endl;
}
